Local PatchMatch Based on Superpixel Cut for Efficient High-resolution Stereo Matching
نویسندگان
چکیده
HIGHLIGHTS A new method of extracting the feature points in superpixels is proposed to compute candidate disparities using non-local cost aggregation. novel two-stage optimization framework for superpixel proposals by first getting labels quickly and then consists label sets updating pixels within corresponding instead assigning a randomly those pixels. The weight combination intensity, gradient binary image designed constructing an optimal minimum spanning tree aggregated matching cost.
منابع مشابه
PatchMatch Stereo - Stereo Matching with Slanted Support Windows
Common local stereo methods match support windows at integer-valued disparities. The implicit assumption that pixels within the support region have constant disparity does not hold for slanted surfaces and leads to a bias towards reconstructing frontoparallel surfaces. This work overcomes this bias by estimating an individual 3D plane at each pixel onto which the support region is projected. Th...
متن کاملHigh-Resolution Stereo Matching based on Sampled Photoconsistency Computation
We propose an approach to binocular stereo that avoids exhaustive photoconsistency computations at every pixel, since they are redundant and computationally expensive, especially for high resolution images. We argue that developing scalable stereo algorithms is critical as image resolution is expected to continue increasing rapidly. Our approach relies on oversegmentation of the images into sup...
متن کاملA New Structural Matching Method Based on Linear Features for High Resolution Satellite Images
Along with commercial accessibility of high resolution satellite images in recent decades, the issue of extracting accurate 3D spatial information in many fields became the centre of attention and applications related to photogrammetry and remote sensing has increased. To extract such information, the images should be geo-referenced. The procedure of georeferencing is done in four main steps...
متن کاملEfficient High-Resolution Stereo Matching using Local Plane Sweeps CVPR 2014
where vectors u and v with ui, vi ∈ [0, 255] denote pixel intensities of 3×3 patches being compared. We use = 10 to downweight textureless regions with low variance. The NCC score is truncated and inverted to obtain a per-pixel matching cost C(x, y, d) = 1 − max(0,NCC(x, y, d)). In our implementation, these per-pixel matching costs C and the pairwise terms Vpq (Equation 1) are multiplied by 255...
متن کاملShader-Based Stereo Matching with Local Algorithms
Modern graphic cards can perform extreme amounts of calculations. In addition, the problem within the field of computer vision is often that the algorithms are very time consuming. The objective of this thesis is to find solutions to the stereo matching problem, employing dense local two-frame stereo matching algorithms and hardware support within modern graphic cards. The performance of the im...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Brazilian Archives of Biology and Technology
سال: 2022
ISSN: ['1678-4324', '1516-8913']
DOI: https://doi.org/10.1590/1678-4324-202210409